ISSN 0333-3590 Iterative decoding for the asymmetric channel

REPORTS IN INFORMATICS ISSN 0333-3590 A Construction for Binary Sequence Sets with Low Peak-to-Average Power Ratio

A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) with respect to any Local Unitary Unimodular Transform (including all one and multi-dimensional Discrete Fourier Transforms).

ISSN 0333-3590 Pathwidth of cubic graphs and exact algorithms

We prove that for any ε > 0 there exists an integer nε such that the pathwidth of every cubic graph on n > nε vertices is at most (1/6 + ε)n. Based on this bound we improve the worst case time analysis for a number of exact exponential algorithms on graphs of maximum vertex degree three.

ISSN 0333-3590 Primal-Dual IPMS for Semidefinite Optimization Based on Finite Barrier Functions

In this paper we extend the results obtained for a class of finite kernel functions by Y.Q. Bai M. El Ghami and C.Roos published in SIAM Journal of Optimization, 13(3):766–782, 2003 [3] for linear optimization to semidefinite optimization. We show that the iteration bound for primal dual methods is O( √ n log n log n ), for large-update methods andO( √ n log n ), for small-update methods. The i...

0333 - 3590 From Indexed to Fibred Semantics — The Generalized Sketch File —

Reports in Informatics Issn 0333-3590 Lex M versus Mcs-m Lex M versus Mcs-m

We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem is Lex M, which was presented in 1976. A new algorithm, and a simplification of Lex M, called MCS-M was presented in 2002. In this paper we compare these two algorithms and show that they produce the same set of chordal graphs, answering an open question mentioned by the authors of MCS-M.